非晶丝GMI磁传感器信号的小波分析

当非晶丝巨磁阻抗效应( Giant Magneto-Impedance,GMI)磁探头输出数据的信噪比小于0时,常规的峰值检波方法难以检出真实信号.为此,提出了一种新的微弱信号检测方法,将非晶丝GMI磁探头的输出信号经放大、滤波和采样之后直接送入数字信号处理系统,利用小波变换方法提取微弱信号的特征,并利用相关分析法确定...     

一种新的小波收缩统一阈值函数

提出一种新的小波收缩统一阈值函数,并证明了新阈值函数具有收敛性,通过调节可变参数的取值可以改变新阈值函数的趋向,为图像阈值去噪的自适应处理提供了可能.此外,给出了新阈值函数的期望、方差与风险的关系式.仿真结果表明新阈值函数不仅能有效去除噪声,而且比两种经典的阈值函数有更高的灵活性,可以获得更高的信噪比和更好的视觉效果.     

An integer decomposition algorithm for solving a two‐stage facility location problem with second‐stage activation costs

We study a stochastic scenario‐based facility location problem arising in situations when facilities must first be located, then activated in a particular scenario before they can be used to satisfy scenario demands. Unlike typical facility location problems, fixed charges arise in the initial location of the facilities, and then in the activation of located facilities. The first‐stage variables in our problem are the traditional binary facility‐location variables, whereas the second‐stage variables involve a mix of binary facility‐activation variables and continuous flow variables. Benders decomposition is not applicable for these problems due to the presence of the second‐stage integer activation variables. Instead, we derive cutting planes tailored to the problem under investigation from recourse solution data. These cutting planes are derived by solving a series of specialized shortest path problems based on a modified residual graph from the recourse solution, and are tighter than the general cuts established by Laporte and Louveaux for two‐stage binary programming problems. We demonstrate the computational efficacy of our approach on a variety of randomly generated test problems. © 2010 Wiley Periodicals, Inc. Naval Research Logistics, 2010     

A multi‐stage stochastic programming approach for network capacity expansion with multiple sources of capacity

In networks, there are often more than one sources of capacity. The capacities can be permanently or temporarily owned by the decision maker. Depending on the nature of sources, we identify the permanent capacity, spot market capacity, and contract capacity. We use a scenario tree to model the uncertainty, and build a multi‐stage stochastic integer program that can incorporate multiple sources and multiple types of capacities in a general network. We propose two solution methodologies for the problem. Firstly, we design an asymptotically convergent approximation algorithm. Secondly, we design a cutting plane algorithm based on Benders decomposition to find tight bounds for the problem. The numerical experiments show superb performance of the proposed algorithms compared with commercial software. © 2016 Wiley Periodicals, Inc. Naval Research Logistics 63: 600–614, 2017     

小波分析在混沌信号识别中的应用研究

通过分析混沌信号和噪声信号的频谱特性以及小波变换对两种信号的作用结果的差异,论证了小波变换是一种有效的去除混沌信号中噪声成分的方法.通过数值仿真研究,证明了小波方法的有效性.最后给出了实验结果.     

大规模代谢网络分解的生物信息学研究

随着大规模分子相互作用数据的不断涌现,生物学网络方面的研究正日益得到重视.代谢网络处于生物体的功能执行阶段,其结构组成方式不仅反映了生物体的功能构成,也直接影响代谢工程中的途径分析和研究.作为代谢网络研究的重要环节,实现网络的合理分解不仅对于基因组范围内分子网络的结构和功能研究具有重要意义,也是代谢工程的途径分析和优化得以顺利进行的前提之一.在回顾代谢网络宏观结构和拓扑特征研究成果的基础上,通过对现有分解方法的深入分析,指出缺乏合理且有针对性的模型评估准则是目前网络分解研究中亟待解决的问题之一.今后的研究趋势在于如何整合更多的信息和发展更先进的分析方法,建立更合理的模型,并进一步拓展网络分解的应用范围.     

流域变换的串行与并行策略研究

流域变换是数字形态学中用于图像分割的一种经典方法,其并行化问题成为近年来研究的重点。首先给出了流域变换的数学模型,并归纳列举了几种离散情况下的形式化定义;其次分类总结了近年来流域变换串行算法研究的新进展,从而在此基础上重点讨论了相应的并行化策略。详细分析了设计并行流域算法需要考虑的几个问题;并比较评价了现有并行算法的性能特点,得出了一些结论;最后提出了有待进一步研究的问题。     

The building evacuation problem with shared information

In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008     

基于小波分形理论的快速图象编码算法

小波和分形理论应用于图象压缩领域是当今研究的前沿。提出了一种快速图象编码算法,它将加权小波变换与基于二叉树和双向链表搜索的分形编码相结合,在高压缩比、高信噪比前提下,使编码时间大大缩短。在ＰｅｎｔｉｕｍＰｒｏ２００个人机上对一２５６×２５６,８ｂｐｐ图象进行实验,编码时间仅需８秒,而图象失真很小。     

正交小波包分析在遥感图像融合中的应用

小波变换具有优良的时频局部特性,但由于其尺度是按二进制变化的,存在“高频低分辨”这一缺陷.正交小波包分析能够将信号(图像)频带进行多层次划分,对多分辨分析没有细分的高频部分进一步分解,从而提高了频率分辨率,能有效地提取特定的频率成分.推导了小波包分析的基本原理,给出了基于正交小波包分析的遥感图像融合算法.最后,通过实例说明正交小波包分析的有效性和优越性.